Multiply generated dynamical systems and the duality of higher rank graph algebras
نویسندگان
چکیده
We define a semidirect product groupoid of a system of partially defined local homeomorphisms T = (T1, . . . , Tr). We prove that this construction gives rise to amenable groupoids. The associated algebra is a Cuntz-like algebra. We use this construction for higher rank graph algebras in order to give a topological interpretation for the duality in E-theory between C∗(Λ) and C∗(Λop). Introduction Toeplitz algebras have been used to define extensions of C-algebras. The beginning of this paper is in [19] where a Toeplitz algebra was the main tool in constructing a K-homology class for higher rank graph algebras. Let (Λ, σ) be a higher rank graph with shape σ (see [16]), Λ the set of morphism of nonzero shape and Λ = {Ω} ∪Λ where Ω is a symbol (the vacuum morphism) which does not belong to Λ. We define left and right creations on the Fock space FΛ = F = l (Λ): Lλδμ = { δλμ if s(λ) = t(μ) 0 otherwise, Rλδμ = { δμλ if s(μ) = t(λ) 0 otherwise. LλΩ = RλΩ = δλ Supportted by the grant 2-CEx06-11-34/2006
منابع مشابه
STONE DUALITY FOR R0-ALGEBRAS WITH INTERNAL STATES
$Rsb{0}$-algebras, which were proved to be equivalent to Esteva and Godo's NM-algebras modelled by Fodor's nilpotent minimum t-norm, are the equivalent algebraic semantics of the left-continuous t-norm based fuzzy logic firstly introduced by Guo-jun Wang in the mid 1990s.In this paper, we first establish a Stone duality for the category of MV-skeletons of $Rsb{0}$-algebras and the category of t...
متن کاملA Family of 2-graphs Arising from Two-dimensional Subshifts
Higher-rank graphs (or k-graphs) were introduced by Kumjian and Pask to provide combinatorial models for the higher-rank Cuntz-KriegerC∗-algebras of Robertson and Steger. Here we consider a family of finite 2-graphs whose path spaces are dynamical systems of algebraic origin, as studied by Schmidt and others. We analyse the C∗-algebras of these 2-graphs, find criteria under which they are simpl...
متن کاملNILPOTENT GRAPHS OF MATRIX ALGEBRAS
Let $R$ be a ring with unity. The undirected nilpotent graph of $R$, denoted by $Gamma_N(R)$, is a graph with vertex set ~$Z_N(R)^* = {0neq x in R | xy in N(R) for some y in R^*}$, and two distinct vertices $x$ and $y$ are adjacent if and only if $xy in N(R)$, or equivalently, $yx in N(R)$, where $N(R)$ denoted the nilpotent elements of $R$. Recently, it has been proved that if $R$ is a left A...
متن کاملENTROPY OF DYNAMICAL SYSTEMS ON WEIGHTS OF A GRAPH
Let $G$ be a finite simple graph whose vertices and edges are weighted by two functions. In this paper we shall define and calculate entropy of a dynamical system on weights of the graph $G$, by using the weights of vertices and edges of $G$. We examine the conditions under which entropy of the dynamical system is zero, possitive or $+infty$. At the end it is shown that, for $rin [0,+infty]$, t...
متن کاملThe H Algebras of Higher Rank Graphs
We begin the study of a new class of operator algebras that arise from higher rank graphs. Every higher rank graph generates a Fock space Hilbert space and creation operators which are partial isometries acting on the space. We call the weak operator topology closed algebra generated by these operators a higher rank semigroupoid algebra. A number of examples are discussed in detail, including t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008